Privacy-Preserving Strategy for Negotiating Stable, Equitable and Optimal Matchings
نویسندگان
چکیده
The assignment problem has a wide variety of applications and in particular, it can be applied to any two-sided market. In this paper, we propose a multi-agent framework to distributively solve this kind of assignment problems, by providing agents which negotiate with respect to their preferences. We present here a realisation of the minimal concession strategy. Our realisation of the minimal concession strategy has useful properties: it preserves the privacy and improves the optimality of the solution and the equity amongst the partners.
منابع مشابه
2 4 O ct 2 01 4 Approximately Stable , School Optimal , and Student - Truthful Many - to - One Matchings ( via Differential Privacy ) ∗
We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their true preferences to the mechanism. Our main tool in this endeavor is differential privacy: we give an algorithm that coordinates a stable matching using differentially private signals, which lead to our truthfulness ...
متن کاملApproximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)
We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their true preferences to the mechanism. Our main tool in this endeavor is differential privacy: we give an algorithm that coordinates a stable matching using differentially private signals, which lead to our truthfulness ...
متن کاملCasanova : un comportement d'agent pour l'équité des mariages préservant la privacité
This paper promotes an individual-based approach for solving a well-known problem, the stable marriage problem. In this approach, a solution is the output of an emergent phenomena due to the negotiation between the agents. For instance, the Gale-Shapley (GS) algorithm implies two distinct behaviours (the proposer and the responder) to reach a stable matching which is pareto-optimal even if it i...
متن کاملDifferentially Private Local Electricity Markets
Privacy-preserving electricity markets have a key role in steering customers towards participation in local electricity markets by guarantying to protect their sensitive information. Moreover, these markets make it possible to statically release and share the market outputs for social good. This paper aims to design a market for local energy communities by implementing Differential Privacy (DP)...
متن کاملA centralized privacy-preserving framework for online social networks
There are some critical privacy concerns in the current online social networks (OSNs). Users' information is disclosed to different entities that they were not supposed to access. Furthermore, the notion of friendship is inadequate in OSNs since the degree of social relationships between users dynamically changes over the time. Additionally, users may define similar privacy settings for their f...
متن کامل